Strategy-proofness in the Large∗

نویسندگان

  • Eduardo M. Azevedo
  • Eric Budish
  • Nabil Al-Najjar
  • Susan Athey
  • Aaron Bodoh-Creed
  • Gabriel Carroll
  • Sylvain Chassang
  • Jeff Ely
  • Alex Frankel
چکیده

We propose a criterion of approximate incentive compatibility, strategy-proofness in the large (SP-L), and argue that it is a useful second-best to exact strategyproofness (SP) for market design. Conceptually, SP-L requires that an agent who regards a mechanism’s “prices” as exogenous to her report – be they traditional prices as in an auction mechanism, or price-like statistics in an assignment or matching mechanism – has a dominant strategy to report truthfully. Mathematically, SP-L weakens SP both by considering incentives in a large-market limit rather than finite economies and by considering incentives from an interim perspective rather than ex-post. ∗First version: October 2011. For helpful discussions we are grateful to Nabil Al-Najjar, Susan Athey, Aaron Bodoh-Creed, Gabriel Carroll, Sylvain Chassang, Jeff Ely, Alex Frankel, Drew Fudenberg, Matt Gentzkow, Jason Hartline, John Hatfield, Richard Holden, Ehud Kalai, Emir Kamenica, Navin Kartik, Fuhito Kojima, Scott Kominers, Jacob Leshno, Jon Levin, Paul Milgrom, Stephen Morris, Roger Myerson, David Parkes, Parag Pathak, Nicola Persico, Andy Postlewaite, Canice Prendergast, Mark Satterthwaite, Ilya Segal, Eran Shmaya, Lars Stole, Rakesh Vohra, Glen Weyl, Mike Whinston, and especially Al Roth. We thank Victor Zhang for excellent research assistance. We are grateful to seminar audiences at Ohio State, the 2011 MFI Conference on Matching and Price Theory, UCLA, Chicago, AMMA 2011, Boston College, the 2011 NBER Conference on Market Design, Duke / UNC, Michigan, Carnegie Mellon / Pittsburgh, Montreal, Berkeley, Northwestern, Rochester, Frontiers of Market Design 2012, ACM EC 2012, Princeton, Maryland, and UPenn. †Wharton, [email protected]. ‡University of Chicago Booth School of Business, [email protected]. STRATEGY-PROOFNESS IN THE LARGE 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No . 629 PAIRWISE STRATEGY - PROOFNESS AND SELF - ENFORCING MANIPULATION *

“Strategy-proofness” is one of the axioms that are most frequently used in the recent literature on social choice theory. It requires that by misrepresenting his preferences, no agent can manipulate the outcome of the social choice rule in his favor. The stronger requirement of “group strategy-proofness” is also often employed to obtain clear characterization results of social choice rules. Gro...

متن کامل

Strategy-Proofness for Hospitals in Matching Markets

Strategy-proof implementation is one of the many elements that have contributed to the successful application of matching theory in real life. However, in many-to-one matching markets without transfers (e.g., doctors to hospitals with fixed salaries) there is no stable mechanism which is strategy-proof for hospitals. Furthermore, strategy-proofness and stability cannot be achieved for both hosp...

متن کامل

Impossibilities for probabilistic assignment

We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...

متن کامل

A decomposition of strategy-proofness

Strategy-proofness has been one of the central axioms in the theory of social choice. We find that strategy-proofness is decomposed into three axioms: top-restricted AM-proofness, weak monotonicity, and individual bounded response. Among them, individual bounded respose is not as defensible as the other two, and we present possibility results by excluding individual bounded response from strate...

متن کامل

Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

In the obnoxious facility game, a location for an undesirable facility is to be determined based on the voting of selfish agents. Design of group strategy proof mechanisms has been extensively studied, but it is known that there is a gap between the social benefit (i.e., the sum of individual benefits) by a facility location determined by any group strategy proof mechanism and the maximum socia...

متن کامل

Generalized monotonicity and strategy−proofness for non−resolute social choice correspondences

Recently there are several works which analyzed the strategy−proofness of non−resolute social choice rules such as Duggan and Schwartz (2000) and Ching and Zhou (2001). In these analyses it was assumed that individual preferences are linear, that is, they excluded indifference from individual preferences. We present an analysis of the strategy−proofness of non−resolute social choice rules when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012